Parallel Shared-Memory State-Space Exploration in Stochastic Modeling
نویسندگان
چکیده
Stochastic modeling forms the basis for analysis in many areas including biological and economic systems as well as the per formance and reliability modeling of computers and communication net works One common approach is the state space based technique which starting from a high level model uses depth rst search to generate both a description of every possible state of the model and the dynamics of the transitions between them However these state spaces besides being very irregular in structure are subject to a combinatorial explosion and can thus become extremely large In the interest therefore of utilizing both the large memory capacity and the greater computational performance of modern multiprocessors we are interested in implementing parallel algorithms for the generation and solution of these problems In this paper we describe the techniques we use to generate the state space of a stochastic Petri net model using shared memory multiprocessors We describe some of the problems encountered and our solutions in particu lar the use of modi ed B trees as a data structure for the parallel search process We present results obtained from experiments on two di erent shared memory machines
منابع مشابه
Parallel Graph Generation Algorithms for Shared and Distributed Memory Machines
In this paper we give an overview and a comparison of two parallel algorithms for the state space generation in stochastic modeling on common classes of multiprocessors In this context state space generation simply means constructing a graph which usually gets extremely large On shared memory machines the key problem for a parallelization is the implementation of a shared data structure which e...
متن کاملParallel Approaches to the Numerical Transient Analysis of Stochastic Reward Nets
This paper presents parallel approaches to the complete tran sient numerical analysis of stochastic reward nets SRNs for both shared and distributed memory machines Parallelization concepts and imple mentation issues are discussed for the three main analysis steps that are generation of the underlying continuous time Markov chain CTMC solving the CTMC numerically for the desired time points and...
متن کاملState space construction and steady-state solution of GSPNs on a shared-memory multiprocessor
A common approach for the quantitative analysis of a generalized stochastic Petri net GSPN is to gener ate its entire state space and then solve the correspond ing continuous time Markov chain CTMC numeri cally This analysis often su ers from two major prob lems the state space explosion and the sti ness of the CTMC In this paper we present parallel algorithms for shared memory machines that at...
متن کاملParallel symbolic state-space exploration is difficult, but what is the alternative?
State-space exploration is an essential first step in many modeling and analysis problems. Its goal is to find and store all the states reachable from the initial state(s) of a discrete-state high-level model described, for example, using pseudocode or Petri nets. The state space can then be used to answer important questions, such as “Is there a dead state?” and “Can variable n ever become neg...
متن کاملA Power and Performance Simulator for a Single-Chip Message-Passing Parallel Architecture
Single-chip parallel computer architectures may provide a solution to the wire latency problem expected as device fecture sizes shrink. Hence the development of efficient single-chip parallel computer is an active area of research. Extensive design space exploration of such architectures requires an architectural simulator that evaluates both power and performance. The available parallel comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997